The Gaussian Interference Relay Channel: Improved Achievable Rates and Sum Rate Upperbounds Using a Potent Relay
نویسندگان
چکیده
منابع مشابه
Capacity Bounds and Achievable Rates of the Gaussian Relay Channel
We present capacity bounds and achievable rates of the Gaussian relay channel. To evaluate achievable rates we consider two cooperative strategies: decode and forward (DF) and compress and forward (CF). We investigate the impact of different channel conditions of the transmitter-relay, relay-receiver, and transmitter-receiver transmission on the bounds and rates. We also compare the results to ...
متن کاملOn the Achievable Rate Sum for Symmetric Gaussian Interference Channels
We compute the exact rate sum of a symmetric Gaussian interference channel for the HanKobayashi region with Gaussian signaling for a subset of parameters in the weak interference regime. In this subset we identify three regimes of operation: an initial set where treating interference as noise is optimal, an intermediate regime where one employs a time-sharing strategy (with power control) betwe...
متن کاملAchievable Rates Of Half-Duplex Relay Networks
This paper discusses two coding approaches for a network of half-duplex relay terminals and presents achievable rates for the discrete memoryless relay channel. Both proposals gain on an implicit (in case of compress-and-forward) or explicit (in case of decode-and-forward) inter-relay cooperation.
متن کاملAn Achievable Rate Region for the Gaussian Interference Channel
Abstract An achievable rate region for the Gaussian interference channel is derived using Sato’s modified frequency division multiplexing idea [1] and a special case of Han and Kobayashi’s rate region (denoted by G′ in [2]). We show that the new inner bound includes G′, Sason’s rate region D [3], as well as the achievable region via TDM/FDM [4], as its subsets. The advantage of this improved in...
متن کاملOn the Rate Achievable for Gaussian Relay Channels Using Superposition Forwarding
We analyze the achievable rate of the superposition of block Markov encoding (decode-and-forward) and side information encoding (compress-and-forward) for the three-node Gaussian relay channel. It is generally believed that the superposition can out perform decode-and-forward or compress-and-forward due to its generality. We prove that within the class of Gaussian distributions, this is not the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2119790